Asymptotic computational complexity - PDFSEARCH.IO - Document Search Engine

Asymptotic computational complexity
Results: 28

#	Item
1	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
2	CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2014-11-27 12:00:09 Computational complexity theory Mathematics Theory of computation Operations research NP-hard problems Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation NP Travelling salesman problem Gap reduction
3	May 19, Spring 2011 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:47:26 Mathematics Computational complexity theory Mathematical analysis Analysis of algorithms Operations research Mathematical notation Asymptotic analysis Dynamic programming Big O notation Time complexity Recurrence relation Knapsack problem
4	Approximation Quality of the Hypervolume Indicator Karl Bringmanna , Tobias Friedrichb a Max-Planck-Institut f¨ ur Informatik, Saarbr¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:16 Computational complexity theory Approximation algorithm Multi-objective optimization Multiplicative inverse Optimization problem Asymptotic analysis
5	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 9, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-03-14 16:00:21 Analysis of algorithms Binary trees Computational complexity theory Asymptotic analysis Sorting algorithms Best worst and average case Binary heap Heap Time complexity Hash table Binary search tree Master theorem
6	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-09-27 14:14:46 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
7	Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula Add to Reading List Source URL: www.cse.unr.edu Language: English - Date: 2012-12-20 19:29:35 Robot control Search algorithms Rapidly-exploring random tree Motion planning Algorithm Asymptotic computational complexity Asymptotically optimal algorithm Probabilistic roadmap Shortest path problem Applied mathematics Mathematics Theoretical computer science
8	Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula Add to Reading List Source URL: iros2011.org Language: English - Date: 2011-09-21 07:00:30 Robot control Search algorithms Rapidly-exploring random tree Motion planning Algorithm Asymptotic computational complexity Asymptotically optimal algorithm Probabilistic roadmap Shortest path problem Applied mathematics Mathematics Theoretical computer science
9	CS109A Notes for LectureRunning Time A program or algorithm has a running time ( ), where is the measure of the size of the input. ( ) is the largest amount of time the program takes on any input of size . Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:57:54 Analysis of algorithms Computational complexity theory Mathematical notation Sorting algorithms Asymptotic analysis Big O notation Time complexity Quicksort Summation Mathematics Theoretical computer science Mathematical analysis
10	counting colours in compressed strings Travis Gagie Juha K¨arkk¨ainen CPM 2011 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-22 14:04:56 Arithmetic functions Analysis of algorithms Asymptotic analysis Mathematical notation Number theory Computational complexity of mathematical operations Chebyshev function Mathematics Mathematical analysis Theoretical computer science

UPDATE